On stability of some lexicographic multicriteria Boolean problem
نویسندگان
چکیده
We consider a multicriteria lexicographic Boolean problem of minimizing absolute deviations of linear functions from zero. We investigate the stability radius which can be understood as a limit level of independent perturbations of the parameters, for which new lexicographic optima do not appear. Lower and upper accessible bounds of the stability radius are obtained.
منابع مشابه
Stability Analysis for a Multicriteria Problem with Linear Criteria and Parameterized Principle of Optimality “from Lexicographic to Slater“
A multicriteria linear programming problem with integer variables and parameterized optimality principle ”from lexicographic to Slater” is considered. A situation in which initial coefficients of penalty cost functions are not fixed but may be potentially a subject to variations is studied. For any efficient solution, appropriate measures of the quality are introduced which incorporate informat...
متن کاملMulticriteria variant of Markowitz ’ s invest - ment problem with Savage ’ s minimax risk criteria under uncertainty TUCS
Based on Markowitz’s classical theory we formulate a multicriteria Boolean portfolio optimization problem using Savage’s minimax risk criteria. We obtain lower and upper attainable bounds for stability radius of the Pareto optimal portfolio in the case of metric l1 in the space of portfolios, and metric l∞ in the space of risks.
متن کاملPostoptimal analysis of one lexicographic combinatorial problem with non-linear criteria
In this article we consider a multicriteria combinatorial problem with ordered MINMIN criteria. We obtain necessary and sufficient conditions of that type of stability to the initial data perturbations for which all lexicographic optima of the original problem are preserved and occurrence of the new ones is allowed. Mathematics subject classification: 90C27, 90C29, 90C31
متن کاملStability and accuracy functions in multicriteria combinatorial optimization problem with Σ-MINMAX and Σ-MINMIN partial criteria
Abstract: We consider a vector generic combinatorial optimization problem in which initial coefficients of objective functions are subject to perturbations. For Pareto and lexicographic principles of efficiency we introduce appropriate measures of quality of a given feasible solution from the point of view of its stability. These measures correspond to so-called stability and accuracy functions...
متن کاملOn stability of some lexicographic integer optimization problem
A lexicographic integer optimization problem with criteria represented by absolute values of linear functions is considered. Five types of stability for the set of lexicographic optima under small changes of the parameters of the vector criterion are investigated.
متن کامل